Segmentation and grouping of object boundaries using energy minimization

نویسندگان

  • D. A. Trytten
  • M. Tuceryan
چکیده

Traditionally, vision systems have largely relied upon the object boundaries extracted from images to accomplish recognition. Most contour detection algorithms, however, suffer from the fact that the extracted object boundaries are usually broken and incomplete due to poor imaging conditions and/or occlusions. In this paper, we describe an algorithm to perform curvilinear grouping of image edge elements for detecting object boundaries. The method works by generating hypotheses and selecting the best one. A neighborhood definition based on Delaunay graph is used to keep the number of hypotheses generated small. An energy minimizing curve is fit to the generated hypotheses to evaluate the grouping and locate discontinuities.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Watersnakes: Energy-Driven Watershed Segmentation

The watershed algorithm from mathematical morphology is powerful for segmentation. However, it does not allow incorporation of a priori information as segmentation methods that are based on energy minimization. In particular, there is no control of the smoothness of the segmentation result. In this paper we show how to represent watershed segmentation as an energy minimization problem, using th...

متن کامل

Segmentation of Imagery Using Network Snakes

A new methodology for the segmentation of imagery using network snakes is presented in this paper. Snakes are a well known technique, but usually are limited to closed object boundaries. Enhancing traditional snakes the focus is on objects forming a network respectively being adjacent with only one boundary in between. In addition, the focus is on linear objects with open non-fixed endings. The...

متن کامل

Uncertainty Driven Multi-scale Energy Minimization

This paper proposes a new multi-scale energy minimization algorithm which can be used to efficiently solve large scale labelling problems in computer vision. The basic modus operandi of any multi-scale method involves the construction of a smaller problem which can be solved efficiently. The solution of this problem is used to obtain a partial labelling of the original energy function, which in...

متن کامل

Using a Novel Concept of Potential Pixel Energy for Object Tracking

Abstract   In this paper, we propose a new method for kernel based object tracking which tracks the complete non rigid object. Definition the union image blob and mapping it to a new representation which we named as potential pixels matrix are the main part of tracking algorithm. The union image blob is constructed by expanding the previous object region based on the histogram feature. The pote...

متن کامل

Superpixels and Supervoxels in an Energy Optimization Framework

Many methods for object recognition, segmentation, etc., rely on tessellation of an image into “superpixels”. A superpixel is an image patch which is better aligned with intensity edges than a rectangular patch. Superpixels can be extracted with any segmentation algorithm, however, most of them produce highly irregular superpixels, with widely varying sizes and shapes. A more regular space tess...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991